Filling holes under non-linear constraints

نویسندگان

چکیده

Abstract In this paper we handle the problem of filling hole in graphic a surface by means patch that joins original with $$\mathcal {C}^{1}$$ C 1 -smoothness and fulfills an additional non-linear geometrical constraint regarding its area or mean curvature at some points. Furthermore, develop technique to estimate optimum is expected have will allow us determine patches system linear quadratic equations. We present several numerical graphical examples showing effectiveness proposed method.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scheduling under Linear Constraints

We introduce a parallel machine scheduling problem in which the processing times of jobs are not given in advance but are determined by a system of linear constraints. The objective is to minimize the makespan, i.e., the maximum job completion time among all feasible choices. This novel problem is motivated by various real-world application scenarios. We discuss the computational complexity and...

متن کامل

Optimal Estimation under Linear Constraints

This paper shows how a multivariate Bayes estimator can be adjusted to satisfy a set of linear constraints. In the direct approach, the constraint is enforced by a restriction on the class of admissible estimators. In an alternative approach, the constraint is merely encouraged by a mixed risk function which penalises misbalance between the estimator and the constraint. The adjustment to the op...

متن کامل

Minimax Linear Regression under Measurement Constraints

We consider the problem of linear regression under measurement constraints and derive computationally feasible subsampling strategies to sample a small portion of design (data) points in a linear regression model y = Xβ + ε. The derived subsampling algorithms are minimax optimal for estimating the regression coefficients β under the fixed design setting, up to a small (1 + ) relative factor. Ex...

متن کامل

Filling Holes in Triangular Meshes Using Digital

We propose a novel approach to automatically fill holes in triangulated models. Each hole is filled using a minimum energy surface that is obtained in three steps. First, we unfold the hole boundary onto a plane using energy minimization. Second, we triangulate the unfolded hole using a constrained Delaunay triangulation. Third, we embed the triangular mesh as a minimum energy surface in R3. Wh...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational & Applied Mathematics

سال: 2023

ISSN: ['1807-0302', '2238-3603']

DOI: https://doi.org/10.1007/s40314-023-02210-3